Extended Haessler Heuristic Algorithm for Cutting Stock Problem: a Case Study in Film Industry

نویسندگان

  • K. Pazand
  • A. Mohammadi
چکیده

The cutting stock problem is an important problem in the field of combinational optimization. In classic versions of this problem, the aim is to find a solution for cutting some equalwidth mother rolls into smaller parts with given width so that the amount of trim-loss become as small as possible. There are plenty of works which addressed the classic cutting stock problem. However in real world applications there are usually some constraints which make the problem different form classical version and make it harder to solve. In this paper we investigate a special cutting stock problem in film industry and show that it can not be solved by using previous methods. We propose a new hybrid method which combines previous methods and takes into account the constraints of this special problem. We applied our method on real data from a film production factory. The experiments show that our method can solve this problem efficiently and outperforms the previous methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

Optimization of the retail steel distribution industry

The present work proposes new heuristics and algorithms for the 3D Cutting and Packing class of problems. Specifically the cutting stock problem and a real-world application from the retail steel distribution industry are addressed. The problem being addressed for the retail steel distribution industry is the retail steel cutting problem, which is how to cut steel in order to satisfy the custom...

متن کامل

Cutting stock problems and solution procedures

This paper discusses some of the basic formulation issues and solution procedures for solving oneand twodimensional cutting stock problems. Linear programming, sequential heuristic and hybrid solution procedures are described. For two-dimensional cutting stock problems with rectangular shapes, we also propose an approach for solving large problems with limits on the number of times an ordered s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012